Stochastic eigenvectors for qualitative stochastic matrices
نویسندگان
چکیده
منابع مشابه
Transforming stochastic matrices for stochastic comparison with the st-order
We present a transformation for stochastic matrices and analyze the effects of using it in stochastic comparison with the strong stochastic (st) order. We show that unless the given stochastic matrix is row diagonally dominant, the transformed matrix provides better st bounds on the steady state probability distribution.
متن کاملStochastic Galerkin Matrices
We investigate the structural, spectral and sparsity properties of Stochastic Galerkin matrices as arise in the discretization of linear differential equations with random coefficient functions. These matrices are characterized as the Galerkin representation of polynomial multiplication operators. In particular, it is shown that the global Galerkin matrix associated with complete polynomials ca...
متن کاملComputational method based on triangular operational matrices for solving nonlinear stochastic differential equations
In this article, a new numerical method based on triangular functions for solving nonlinear stochastic differential equations is presented. For this, the stochastic operational matrix of triangular functions for It^{o} integral are determined. Computation of presented method is very simple and attractive. In addition, convergence analysis and numerical examples that illustrate accuracy and eff...
متن کاملSomewhat Stochastic Matrices
The notion of a Markov chain is ubiquitous in linear algebra and probability books. In linear algebra a Markov chain is a sequence {xk} of vectors defined recursively by a specified vector x0, a square matrix P and the recursion xk = Pxk−1 for k = 1, 2, . . .. That is, xk = P x0. Natural probabilistic restrictions are imposed on x0 and P . It is assumed that x0 is a probability vector; that is,...
متن کاملMultiplicative Updates for Learning with Stochastic Matrices
Stochastic matrices are arrays whose elements are discrete probabilities. They are widely used in techniques such as Markov Chains, probabilistic latent semantic analysis, etc. In such learning problems, the learned matrices, being stochastic matrices, are non-negative and all or part of the elements sum up to one. Conventional multiplicative updates which have been widely used for nonnegative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90155-3